On Barycentric Subdivision
نویسندگان
چکیده
Consider the barycentric subdivision which cuts a given triangle along its medians to produce six new triangles. Uniformly choosing one of them and iterating this procedure gives rise to a Markov chain. We show that almost surely, the triangles forming this chain become flatter and flatter in the sense that their isoperimetric values goes to infinity with time. Nevertheless, if the triangles are renormalized through a similitude to have their longest edge equal to [0, 1] ⊂ C (with 0 also adjacent to the shortest edge), their aspect does not converge and we identify the limit set of the opposite vertex with the segment [0,1/2]. In addition we prove that the largest angle converges to π in probability. Our approach is probabilistic and these results are deduced from the investigation of a limit iterated random function Markov chain living on the segment [0,1/2]. The stationary distribution of this limit chain is particularly important in our study.
منابع مشابه
Invariance of the barycentric subdivision of a simplicial complex
In this paper we prove that a simplicial complex is determined uniquely up to isomorphism by its barycentric subdivision as well as its comparability graph. We also put together several algebraic, combinatorial and topological invariants of simplicial complexes.
متن کاملThe Γ-vector of a Barycentric Subdivision
We prove that the γ-vector of the barycentric subdivision of a simplicial sphere is the f -vector of a balanced simplicial complex. The combinatorial basis for this work is the study of certain refinements of Eulerian numbers used by Brenti and Welker to describe the h-vector of the barycentric subdivision of a boolean complex.
متن کاملf-VECTORS OF BARYCENTRIC SUBDIVISIONS
For a simplicial complex or more generally Boolean cell complex ∆ we study the behavior of the f and h-vector under barycentric subdivision. We show that if ∆ has a non-negative h-vector then the h-polynomial of its barycentric subdivision has only simple and real zeros. As a consequence this implies a strong version of the Charney-Davis conjecture for spheres that are the subdivision of a Bool...
متن کاملCordial Labeling in Context of Barycentric Subdivision of Special Graphs
In this paper we discuss cordial labeling in context of barycentric subdivision of shell graph, complete bipartite graph Kn,n and wheel graph. AMS subject classification: 05C78.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 2011